Randomized Algorithms For Packet Routing on the Mesh
نویسنده
چکیده
Packet routing is an important problem of parallel computing since a fast algorithm for packet routing will imply 1) fast inter-processor communication, and 2) fast algorithms for emulating ideal models like PRAMs on fixed connection machines.There are three different models of packet routing, namely 1) Store and forward, 2) Multipacket, and 3) Cut through. In this paper we provide a survey of the best known randomized algorithms for store and forward routing, k-k routing, and cut through routing on the Mesh Connected Computers. Comments University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MSCIS-91-92. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/328 Randomized Algorithms For Packet Routing On The Mesh MS-CIS-91-92 GRASP LAB 289 Sanguthevar Rajasekaran Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389
منابع مشابه
A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملOptimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of ` (resp., k) packets, for arbitrary values of ` and k. All our algorithms run in optimal O (√ `kn ) time and use queues of on...
متن کاملRouting Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms
are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...
متن کاملMesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection
Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with fixed buses, and 2) a mesh with reconfigurable buses. Both these models have been the subject matter of extensive previous research. We solve numerous important problems related to packet routing, sorting, and se...
متن کاملMesh Connected Computers with Fixed and Reconngurable Buses: Packet Routing, Sorting, and Selection
Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with xed buses, and 2) a mesh with reconngurable buses. Both these models have been the subject matter of extensive previous research. We solve numerous important problems related to packet routing, sorting, and selec...
متن کامل